Weak optimal inverse problems of interval linear programming based on KKT conditions

نویسندگان

چکیده

Abstract In this paper, weak optimal inverse problems of interval linear programming (IvLP) are studied based on KKT conditions. Firstly, the problem is precisely defined. Specifically, by adjusting minimum change current cost coefficient, a given solution can become optimal. Then, an equivalent characterization IvLP obtained. Finally, simplified without coefficient null variable.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Providing a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach

Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...

متن کامل

The optimal solution set of the interval linear programming problems

Determining the set of all optimal solutions of a linear program with interval data is one of the main problems discussed in interval optimization. We review two methods based on duality in linear programming, which are used to approximate the optimal set. Additionally, another decomposition method based on complementary slackness is proposed. This method provides the exact description of the o...

متن کامل

Constraint Qualifications and KKT Conditions for Bilevel Programming Problems

In this paper we consider the bilevel programming problem (BLPP), which is a sequence of two optimization problems where the constraint region of the upper-level problem is determined implicitly by the solution set to the lower-level problem. We extend well-known constraint qualifications for nonlinear programming problems such as the Abadie constraint qualification, the Kuhn-Tucker constraint ...

متن کامل

Inverse linear programming with interval coefficients

The paper deals with the inverse linear programming problem over intervals. More precisely, given interval domains for the objective function coefficients and constraint coefficients of a linear program, we ask for which scenario a prescribed optimal value is attained. Using continuity of the optimal value function (under some assumptions), we propose a method based on parametric linear program...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics-a Journal of Chinese Universities Series B

سال: 2021

ISSN: ['1005-1031', '1993-0445', '1000-4424']

DOI: https://doi.org/10.1007/s11766-021-4324-2